Simple Equational Specifications of Rational Arithmetic
نویسنده
چکیده
We exhibit an initial specification of the rational numbers equipped with addition, subtraction, multiplication, greatest integer function, and absolute value. Our specification uses only the sort of rational numbers. It uses one hidden function; that function is unary. But it does not use an error constant, or extra (hidden) sorts, or conditional equations. All of our work is elementary and self-contained.
منابع مشابه
Elementary Algebraic Specifications of the Rational Complex Numbers
From the range of techniques available for algebraic specifications we select a core set of features which we define to be the elementary algebraic specifications. These include equational specifications with hidden functions and sorts and initial algebra semantics. We give an elementary equational specification of the field operations and conjugation operator on the rational complex numbers Q(...
متن کاملTowards a Datatype Defining Rewrite System for Rational Arithmetic
In [3] the concept of datatype defining rewrite systems (DDRSs) is introduced. A DDRS is an equational specification of a datatype that yields a ground-complete term rewriting system (TRS) when its equations are interpreted from left to right as rewrite rules. In [3] a number of DDRSs are presented for terms in unary, binary, and decimal notation. The goal of the present work is to review wheth...
متن کاملIntegrating Decision Procedures in Reflective Rewriting-Based Theorem Provers ?
We propose a design for the integration of decision procedures in reflective rewritingbased equational theorem provers. Rewriting-based equational theorem provers use term rewriting as their basic proof engine; they are particularly well suited for proving properties of equational specifications. A reflective rewriting-based theorem prover is itself an executable equational specification, which...
متن کاملSynthesis of Mealy Machines Using Derivatives
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic computation of the coalgebraic notion of stream function derivative, a generalisation of the Brzozowski derivative of regular expressions. In this paper we complete the construction of Mealy machines from specifications in...
متن کاملSpecification Translation of State Machines from Equational Theories into Rewrite Theories
Specifications of state machines in CafeOBJ are called equational theory specifications (EQT Specs) which are based on equational logic, and in Maude are called rewrite theory specifications (RWT Specs) which are based on rewriting logic. The translation from EQT Specs to RWT Specs achieves the collaboration between CafeOBJ’s theorem proving facilities and Maude’s model checking facilities. How...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics & Theoretical Computer Science
دوره 4 شماره
صفحات -
تاریخ انتشار 2001